Top-k Queries in Uncertain OLAP
نویسنده
چکیده
Top-k is the most important query type in OLAP, the most common data warehouses model. Recently, OLAP was extended to represent data ambiguity, specifically imprecision and uncertainty. However, how to deal with top-k queries in uncertain OLAP still remain an unanswered question. This project introduces a complete solution for top-k query in uncertain OLAP including query semantic definition, query processing algorithm and data materialization. An experimental evaluation showed that the proposed solution is feasible.
منابع مشابه
Top-k Queries in Uncertain OLAP Master Scholarly Paper
Top-k is the most important query type in OLAP, a common data warehouses model. Recently, OLAP was extended to represent data ambiguity, specifically imprecision and uncertainty. However, how to deal with top-k queries in uncertain OLAP still remains an unanswered question. This project introduces a solution for top-k query evaluation in uncertain OLAP including query semantic definition, query...
متن کاملAn efficient, robust method for processing of partial top-k/bottom-k queries using the RD-Tree in OLAP
Online analytical processing (OLAP) is a widely used technology for facilitating decision support applications. In the paper, we consider partial aggregation queries, especially for partial top-k/bottom-k, which retrieve the top/bottom-k records among the specified cells of the given query. For the efficient processing of partial ranking queries, this paper proposes a set of algorithms using th...
متن کاملRanking queries on uncertain data pdf
Top-k queries also known as ranking queries are often natural and useful in. Ing probabilistic threshold top-k queries on uncertain data.UNCERTAIN DATA MODELS W.R.T RANKING QUERIES. Uncertain attribute based on the associated discrete pdf and the choice is.observed, the semantics of top-k queries on uncertain data can be ambiguous due to tradeoffs. Whether it is better to report highly ranked i...
متن کاملK 2-Treaps: Range Top-k Queries in Compact Space
Efficient processing of top-k queries on multidimensional grids is a common requirement in information retrieval and data mining, for example in OLAP cubes. We introduce a data structure, the K-treap, that represents grids in compact form and supports efficient prioritized range queries. We compare the K-treap with state-of-the-art solutions on synthetic and real-world datasets, showing that it...
متن کاملRange Top/Bottom k Queries in OLAP Sparse Data Cubes
A range top k query finds the top k maximum values over all selected cells of an OLAP data cube where the selection is specified by the range of contiguous values for each dimension. In this paper, we propose a partitionbased storage structure, which is capable of answering both range top and bottom k queries in OLAP sparse data cubes. This is achieved by partitioning a multi-dimensional sparse...
متن کامل